﻿#region Copyright (c) 2003 - 2008, Andreas Mueller
/////////////////////////////////////////////////////////////////////////////////////////
// 
// Copyright (c) 2003 - 2008, Andreas Mueller.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// Contributors:
//    Andreas Mueller - initial API and implementation
//
// 
// This software is derived from software bearing the following
// restrictions:
// 
// Copyright (c) 1994
// Hewlett-Packard Company
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Hewlett-Packard Company makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// Copyright (c) 1996,1997
// Silicon Graphics Computer Systems, Inc.
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// (C) Copyright Nicolai M. Josuttis 1999.
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
// 
/////////////////////////////////////////////////////////////////////////////////////////
#endregion
using System.Collections.Generic;
using NStl.Iterators.Support;
using NStl.Linq;
using System.Collections;
using NUnit.Framework;
using NStl.SyntaxHelper;

namespace NStl.NUnit.AlgorithmFixtures.UpperBound
{
    [TestFixture]
    public class UpperBoundWithPredicateFixture : AlgorithmBaseFixture
    {

        [Test]
        public override void SuccessfullPass()
        {
            List<int> v = new List<int> {4, 10, 10, 30, 45, 70, 60, 100};
            ListTIterator<int> itFound = 
                Algorithm.UpperBound(v.Begin(), v.End(), 10, Compare.Less<int>());
            Assert.AreNotEqual(itFound, v.End());
            Assert.AreEqual(itFound.Value, 30);

            itFound =
                Algorithm.UpperBound(v.Begin(), v.End(), 42, Compare.Less<int>());
            Assert.AreNotEqual(itFound, v.End());
            Assert.AreEqual(itFound.Value, 45);
        }
        [Test]
        public void SuccessfullPassWhenLengthIs3()
        {
            List<int> v = new List<int> {3, 3, 4};
            ListTIterator<int> itFound =
                Algorithm.UpperBound(v.Begin(), v.End(), 3, Compare.Less<int>());
            Assert.AreNotEqual(itFound, v.End());

            ICollection expected = new[] { 3, 3 };
            ICollection actual = v.Begin().AsCollection(itFound);

            CollectionAssert.AreEqual(expected, actual);
        }
        [Test]
        public override void NonSuccessfullPass()
        {
            List<int> v = new List<int> {4, 10, 10, 30, 45, 70, 60, 100};
            ListTIterator<int> itFound =
                Algorithm.UpperBound(v.Begin(), v.End(), 4242, Compare.Less<int>());
            Assert.AreEqual(itFound, v.End());
        }

        [Test]
        public override void StartIteratorIsEqualToEndIterator()
        {
            List<int> v = new List<int> {4, 10, 10, 30, 45, 70, 60, 100};
            ListTIterator<int> itFound =
                Algorithm.UpperBound(v.Begin(), v.Begin(), 10, Compare.Less<int>());
            Assert.AreEqual(itFound, v.Begin());
        }
    }
}
